concurrent algorithm造句

例句与造句

1. A concurrent algorithm can perform differently on different runs due to a race condition.
2. PCN includes the language for specifying concurrent algorithms and interfaces to C and Fortran.
3. Concurrency control can require significant additional complexity and overhead in a concurrent algorithm compared to the simpler sequential algorithm.
4. Further, non-parallel, non-concurrent algorithms are often referred to as " sequential algorithms ", by contrast with concurrent algorithms.
5. Further, non-parallel, non-concurrent algorithms are often referred to as " sequential algorithms ", by contrast with concurrent algorithms.
6. It's difficult to find concurrent algorithm in a sentence. 用concurrent algorithm造句挺难的
7. Dijkstra's algorithmic work ( especially graph algorithms, concurrent algorithms, and distributed algorithms ) plays an important role in many areas of computing science.
8. The academic study of concurrent algorithms started in the 1960s, with credited with being the first paper in this field, identifying and solving mutual exclusion.
9. At first it appeared that CSL was well suited to what Dijkstra has called loosely connected processes, but perhaps not to fine-grained concurrent algorithms with significant interference.
10. The academic study of concurrent programming ( concurrent algorithms in particular ) started in the 1960s, with Edsger Dijkstra ( 1965 ) credited with being the first paper in this field, identifying and solving mutual exclusion.
11. Many parallel algorithms are executed concurrently  though in general concurrent algorithms are a distinct concept  and thus these concepts are often conflated, with which aspect of an algorithm is parallel and which is concurrent not being clearly distinguished.
12. In computer science, a "'concurrent algorithm "'is one that can be Concurrency often adds significant complexity to an algorithm, requiring concurrency control such as mutual exclusion to avoid problems such as race conditions.
13. The requirement of mutual exclusion was first identified and solved by Edsger W . Dijkstra in his seminal 1965 paper titled " Solution of a problem in concurrent programming control ", which is credited as the first topic in the study of concurrent algorithms.
14. The requirement of mutual exclusion was first identified and solved by Edsger W . Dijkstra in his seminal 1965 paper titled " Solution of a problem in concurrent programming control ", and is credited as the first topic in the study of concurrent algorithms.
15. The problem is how to design a discipline of behavior ( a concurrent algorithm ) such that no philosopher will starve; i . e ., each can forever continue to alternate between eating and thinking, assuming that no philosopher can know when others may want to eat or think.
16. On 5 April 2010, Dave Dice, Yossi Lev, Virendra Marathe, Mark Moir, Marek Olszewski and Dan Nussbaum released a paper " Simplifying Concurrent Algorithms by Exploiting Hardware Transactional Memory " to be presented at the 22nd ACM Symposium on Parallelism in Algorithms and Architectures ( SPAA 2010 ).
更多例句：  下一页